EDSC: Efficient document subspace clustering technique for high-dimensional data

With the advancement in the pervasive technology, there is a spontaneous rise in the size of the data. Such data are generated from various forms of resources right from individual to organization level. Due to the characteristics of unstructured or semi-structuredness in data representation, the existing data analytics approaches are not directly applicable which leads to curse of dimensionality problem. Hence, this paper presents an Efficient Document Subspace Clustering (EDSC) technique for high-dimensional data that contributes to the existing system with respect to identification by eliminating the redundant data. The discrete segmentation of data points are used to explicitly expose the dimensionality of hidden subspaces in the clusters. The outcome of the proposed system was compared with existing system to find the effective document clustering process for high-dimensional data. The processing time of EDSC for subspace clustering is reduced by 50% as compared to the existing system

RMSC: Robust Modeling of Subspace Clustering for high dimensional data

Subspace clustering is one of the active research problem associated with high-dimensional data. Here some of the standard techniques are reviewed to investigate existing methodologies. Although, there have been various forms of research techniques evolved recently, they do not completely mitigate the problems pertaining to noise sustainability and optimization of clustering accuracy. Hence, a novel technique called as Robust Modeling of Subspace Clustering (RMSC) presented to solve the above problem. An analytical research methodology is used to formulate two algorithms for computing outliers and for extracting elite subspace from the highdimensional data inflicted by different forms of noise. RMSC was found to offer higher accuracy and lower error rate both in presence of noise and absence of noise over high-dimensional data. © 2017 IEEE

Bimodal Biometric Verification Mechanism using fingerprint and face images(BBVMFF)

An increased demand of biometric authentication coupled with automation of systems is observed in the recent times. Generally biometric recognition systems currently used consider only a single biometric characteristic for verification or authentication. Researchers have proved the inefficiencies in unimodal biometric systems and propagated the adoption of multimodal biometric systems for verification. This paper introduces Bi-modal Biometric Verification Mechanism using Fingerprint and Face (BBVMFF). The BBVMFF considers the frontal face and fingerprint biometric characteristics of users for verification. The BBVMFF Considers both the Gabor phase and magnitude features as biometric trait definitions and simple lightweight feature level fusion algorithm. The fusion algorithm proposed enables the applicability of the proposed BBVMFF in unimodal and Bi-modal modes proved by the experimental results presented

PCAD: Power control attack detection in wireless sensor networks

Security in wireless sensor networks is critical due to its way of open communication. In this paper we have provided a solution to detect malicious nodes which perform radio transmission power control attack and sinkhole attack in wireless sensor networks. In the proposed approach, data transmission is divided into multiple rounds of equal time duration. Each node chooses the parent node in the beginning of the round for forwarding the packet towards sink. Each node adds its identity in the packet as a routing path marker and encrypts before forwarding to parent. Child node observes the parent, handles acknowledgement from 2-hop distance node and decides the trust on parent based on successful and unsuccessful transactions. Each node sends a trust value report via multiple paths to Sink at the end of the round. Sink identifies the malicious node by comparing trust value report received from each node with number of data packets received. Simulated the algorithm in NS-3 and performance analysis compared with other recently proposed approach. Simulation results show that proposed method detect the malicious nodes efficiently and early. © 2016 IEEE

An efficient cloud based architecture for integrating content management systems

The use of digital content is increasing day after day and now it is an essential element of our day today life. The amount of stored information is so huge that it is highly difficult to manage the content especially in a distributed cloud environment. There are many open source software solutions available in cloud to handle huge amount of digital data. However none of these solutions addresses all the requirements needed to manage the content spread out in multiple systems effectively. The user has to relay on multiple content management systems to do the work. This turns into ever more unwieldy, time consuming and leads to loss of data. Using robust and integrated content management systems, these issues could be solved effectively. In this paper we have identified various challenges of using the content management system in the cloud after surveying many Content Management System related article and proposed an integrated solution named Cloud based Architecture integrating Content Management System which is capable of interfacing with various unique features available at different content management system installations in the cloud. This maximizes the functionality and performance of any Content management systems. The Representational State Transfer (REST) protocol is used to integrate the best features of various open source content management systems. REST provides higher level of security compared to existing systems as it does not store the user sessions. The users can interact with the system with the help of an interface which abstracts the complexities of multiple content management systems running in the cloud. © 2017 IEEE

Growth, Imbalance and Indian Economy

Professor K Venkatagiri Gowda was an incisive thinker par excellence. His Economic analysis on the budget were very much valued by the Economists and Administrator in the Country. His work has been internationally valued as definitive and path breaking in the Area of Monetary Economics, International finance and Planing. He has received Lord Leverhulme special Research Award, London School of Economics, 1935-55, and the Karnataka Rajotsava Award in 1983. The book is collection of 83 articles written by Professor Gowda which provide solutions to myriad of Economic problems of our Country

A self-adaptive migration model genetic algorithm for data mining applications

Data mining involves nontrivial process of extracting knowledge or patterns from large databases. Genetic Algorithms are efficient and robust searching and optimization methods that are used in data mining. In this paper we propose a Self-Adaptive Migration Model GA (SAMGA), where parameters of population size, the number of points of crossover and mutation rate for each population are adaptively fixed. Further, the migration of individuals between populations is decided dynamically. This paper gives a mathematical schema analysis of the method stating and showing that the algorithm exploits previously discovered knowledge for a more focused and concentrated search of heuristically high yielding regions while simultaneously performing a highly explorative search on the other regions of the search space. The effective performance of the algorithm is then shown using standard testbed functions and a set of actual classification datamining problems. Michigan style of classifier was used to build the classifier and the system was tested with machine learning databases of Pima Indian Diabetes database, Wisconsin Breast Cancer database and few others. The performance of our algorithm is better than others. © 2007 Elsevier Inc. All rights reserved

A heuristic for placement of limited range wavelength converters in all-optical networks

Wavelength routed optical networks have emerged as a technology that can effectively utilize the enormous bandwidth of the optical fiber. Wavelength converters play an important role in enhancing the fiber utilization and reducing the overall call blocking probability of the network. As the distortion of the optical signal increases with the increase in the range of wavelength conversion in optical wavelength converters, limited range wavelength conversion assumes importance. Placement of wavelength converters is a NP complete problem [K.C. Lee, V.O.K. Li, IEEE J. Lightwave Technol. 11 (1993) 962-970] in an arbitrary mesh network. In this paper, we investigate heuristics for placing limited range wavelength converters in arbitrary mesh wavelength routed optical networks. The objective is to achieve near optimal placement of limited range wavelength converters resulting in reduced blocking probabilities and low distortion of the optical signal. The proposed heuristic is to place limited range wavelength converters at the most congested nodes, nodes which lie on the long lightpaths and nodes where conversion of optical signals is significantly high. We observe that limited range converters at few nodes can provide almost the entire improvement in the blocking probability as the full range wavelength converters placed at all the nodes. Congestion control in the network is brought about by dynamically adjusting the weights of the channels in the link thereby balancing the load and reducing the average delay of the traffic in the entire network. Simulations have been carried out on a 12-node ring network, 14-node NSFNET, 19-node European Optical Network (EON), 28-node US long haul network, hypothetical 30-node INET network and the results agree with the analysis. (C) 2001 Elsevier Science B.V, All rights reserved

PFU: Profiling Forum users in online social networks, a knowledge driven data mining approach

Online Social Networks (OSNs) provide platform to raise opinions on various issues, create and spread news rapidly in Online Social Network Forums (OSNFs). This work proposes a novel method for Profiling Forum Users (PFU) by exploring their behavioral characteristics based on their involvement in various topics of discussion and number of posts in respective topics posted by them in OSNFs dynamically. Modeling the proposed method mathematically, the PFU algorithm is illustrated for its adequacy and accuracy

CPMTS: Catching packet modifiers with trust support in wireless sensor networks

Security in wireless sensor networks is critical due to its way of open communication. Packet modification is a common attack in wireless sensor networks. In literature, many schemes have been proposed to mitigate such an attack but very few detect the malicious nodes effectively. In the proposed approach, each node chooses the parent node for forwarding the packet towards sink. Each node adds its identity and trust on parent as a routing path marker and encrypts only the bytes added by node in packet before forwarding to parent. Sink can determine the modifiers based on trust value and node identities marked in packet. Child node observes the parent and decides the trust on parent based on successful and unsuccessful transactions. Data transmission is divided into multiple rounds of equal time duration. Each node chooses the parent node at the beginning of a round based on its own observation on parent. Simulated the algorithm in NS-3 and performance analysis is discussed. With the combination of trust factor and fixed path routing to detect malicious activity, analytical results show that proposed method detect modifiers efficiently and early, and also with low percentage of false detection